基于stackelberg多步博弈的无人机协同搜索路径规划

考虑到现有无人机搜索问题研究中无人机、移动目标仅有一方具有远距离探测能力的设定，已经无法体现出战场环境下双方的博弈关系。针对这一不足，基于stackelberg均衡策略，结合多步预测的思想，提出了stackelberg多步博弈策略，实现了无人机、目标都具有远距离探测能力的博弈搜索。通过建立无人机、目标各自的路径收益函数，使双方能够根据不同时刻的博弈状态选择相对应的函数，实现无人机的动态路径规划。仿真结果表明所提出策略完全适用于该博弈模型，比贪婪策略具有更高的搜索效率，大大提高了目标捕获率。     

An analysis of adaptive planning capacity: The case of chilean water utilities

New long-term planning approaches capable of coping with uncertainties such as climate change, rapid urbanization, and changing societal values, have been put forward as a way of producing more robust and sustainable plans for the future. But is the planning practice ready for their adoption? This paper takes four key propositions from the adaptive planning literature and tests the existing capacity for adopting those propositions in the context of Chilean water utilities. We will then propose how existing capacities could be enhanced, and propose alternatives for current planning practices, highlighting the importance of implementation through experimentation.     

Team O2AS at the world robot summit 2018: an approach to robotic kitting and assembly tasks using general purpose grippers and tools

ABSTRACT

In this article, we propose a versatile robotic system for kitting and assembly tasks which uses no jigs or commercial tool changers. Instead of specialized end effectors, it uses its two-finger grippers to grasp and hold tools to perform subtasks such as screwing and suctioning. A third gripper is used as a precision picking and centering tool, and uses in-built passive compliance to compensate for small position errors and uncertainty. A novel grasp point detection for bin picking is described for the kitting task, using a single depth map. Using the proposed system we competed in the Assembly Challenge of the Industrial Robotics Category of the World Robot Challenge at the World Robot Summit 2018, obtaining 4th place and the SICE award for lean design and versatile tool use. We show the effectiveness of our approach through experiments performed during the competition.     

In Silico Study on Tumor-Size-Dependent Thermal Profiles inside an Anthropomorphic Female Breast Phantom Subjected to Multi-Dipole Antenna Array

Electromagnetic hyperthermia as a potent adjuvant for conventional cancer therapies can be considered valuable in modern oncology, as its task is to thermally destroy cancer cells exposed to high-frequency electromagnetic fields. Hyperthermia treatment planning based on computer in silico simulations has the potential to improve the localized heating of breast tissues through the use of the phased-array dipole applicators. Herein, we intended to improve our understanding of temperature estimation in an anatomically accurate female breast phantom embedded with a tumor, particularly when it is exposed to an eight-element dipole antenna matrix surrounding the breast tissues. The Maxwell equations coupled with the modified Pennes’ bioheat equation was solved in the modelled breast tissues using the finite-difference time-domain (FDTD) engine. The microwave (MW) applicators around the object were modelled with shortened half-wavelength dipole antennas operating at the same 1 GHz frequency, but with different input power and phases for the dipole sources. The total input power of an eight-dipole antenna matrix was set at 8 W so that the temperature in the breast tumor did not exceed 42 °C. Finding the optimal setting for each dipole antenna from the matrix was our primary objective. Such a procedure should form the basis of any successful hyperthermia treatment planning. We applied the algorithm of multi for multi-objective optimization for the power and phases for the dipole sources in terms of maximizing the specific absorption rate (SAR) parameter inside the breast tumor while minimizing this parameter in the healthy tissues. Electro-thermal simulations were performed for tumors of different radii to confirm the reliable operation of the given optimization procedure. In the next step, thermal profiles for tumors of various sizes were calculated for the optimal parameters of dipole sources. The computed results showed that larger tumors heated better than smaller tumors; however, the procedure worked well regardless of the tumor size. This verifies the effectiveness of the applied optimization method, regardless of the various stages of breast tumor development.     

Rolling Kanban: a new visual tool to schedule family batch manufacturing processes with kanban

Rolling Kanban is the name of a kanban management methodology for batch processes manufacturing environment. Proposed in the early 2000s by FESTO Consulting, for two decades we have lost knowledge both from operative and scientific point of view. Basically, Rolling Kanban means a visual planning methodology based on the production of product-families and variants where: (i) set-up times are reduced between the products of the same family, and (ii) relevant times (dozens of minutes if not even hours) must be considered for changeover between products of different families. In addition, the cyclic production sequence between different product families cannot be maintained. Considering that very few technical information and documents are available about this approach, the main objective of this paper is to retrieve and present, for the first time to the scientific community, the Rolling Kanban methodology. Besides, a real industrial implementation concerning a manufacturer of domestic fittings is discussed as a case study. More specifically, two novel versions of the original Rolling Kanban technique are fully presented to effectively overcome certain limits and criticalities found during its operative use, such as the difficulty to realise a pull production, considering increased set-up time for changeover between products of different families.     

Disassembly sequence planning using a Flatworm algorithm

Disassembly Sequence Planning (DSP) refers to a disassembly sequence based on the disassembly properties and restrictions of the product parts that meets the benefit goal. This study aims to reduce the number of changes in disassembly direction and disassembly tools so as to reduce the disassembly time. This study proposes a novel Flatworm algorithm that evolves through the regenerative properties of the flatworm. It is similar to the evolutionary concept of genetic algorithms, with evolution as the main idea, but without crossover, mutation or replication mechanisms in the evolutionary processes. Instead, it is based upon the characteristics of the growth, fracture and regeneration mechanisms of the flatworm. The Flatworm algorithm features a variety of disassembly combinations and excellent mechanisms to avoid the local optimal solution. In particular, it has the advantage of keeping a good disassembly combination from being destroyed. In this study, it is compared with two genetic algorithms and two ant colony algorithms and tested in three examples of different complexity: a ceiling fan, a printer, and 150 simulated parts. The solution searching ability and execution time are compared upon the same evaluation standard. The test results demonstrate that the novel Flatworm algorithm proposed in this study is superior to the two genetic algorithms and ant colony algorithms in solution quality.     

Estonian urbanism 1935–1955: the Soviet-era implementation of pre-war ambitions

Estonian 1940s–1950s town planning practices show that Stalinist principles were in line with those of Estonian architects during the 1930s pre-war, independence period. However, between 1944 and 1955, within the context of the Soviet regime’s occupation, urban planning was faced with rigid ideological constraints. After the Second World War, Estonian architects were forced to abandon projects in historical city centres, which focused on maintaining local natural conditions and cultural heritage, as well as using local materials. Some existing town centres, such as in Tallinn, Narva, and Pärnu, were reconstructed after suffering damage in the war, as well as for ideological reasons. Yet, during this time period, most efforts were directed towards building new industrial towns in East Estonia that exemplified a Stalinist utopia; this also presented the Soviet regime with an opportunity to exploit local mineral resources.     

Motion Planning by T‐RRT with Potential Function for Vertical Articulated Robots

RRT (rapidly exploring random tree) with random sampling is an effective method for path planning, and is often used for robot manipulators. The RRT has many modified methods for applying various problems and conditions. Particularly, T‐RRT (Transition‐based RRT) one of those has advantage that it is able to adopt arbitrary evaluation function. In this paper, a novel path planning method based on the T‐RRT is proposed for ensuring “quality” of a generated path. Then, its effectiveness is evaluated via comparison with other sampling‐based methods using simulation of the industrial robot having seven DOFs.     

Multi-product continuous plant scheduling: combination of decomposition,genetic algorithm,and constructive heuristic

We propose a polylithic method for medium-term scheduling of a large-scale industrial plant operating in a continuous mode. The method combines a decomposition approach, a genetic algorithm (GA) and a constructive MILP-based heuristic. In the decomposition, decisions are made at two levels, using the rolling horizon approach. At the upper level, a reduced set of products and the time period is chosen to be considered in the lower level. At the lower level, a short-term scheduling MILP-model with event-based representation is used. A heuristic solution to the lower level problem is found using a constructive Moving Window heuristic guided by a genetic algorithm. The GA is applied for finding efficient utilisation of critical units in the lower level problem. For solving the one unit scheduling problem, a parallel dynamic programming algorithm is proposed. Implementation of the dynamic programming algorithm for a graphics processing unit (GPU) is incorporated in the GA for improving its performance. The experimental study of the proposed method on a real case of a large-scale plant shows a significant improvement of the solution quality and the solving time comparing to the pure decomposition algorithm proposed in the earlier study, and confirmed suitability of the proposed approach for the real-life production scheduling. In particular, the reduction of the number of changeovers and their duration in the obtained solution as well as the CPU time of solving the problem was about 60% using the new approach.     

基于协同多目标算法的多机器人路径规划

多机器人路径规划是群体机器人协同工作的前提,其特点是在防碰撞与避障的前提下追求多方面资源的最小消耗.针对这一特点,提出协同非支配排序遗传算法,解决具有多个优化目标的多机器人路径规划问题;运用改进的多目标优化算法,克服多目标优化取权值的不足,同时考虑机器人能源与时间两大资源,以多机器人的路径总长度、总平滑度、总耗时为规划目标.同时引入合作型协同算法框架,将难以求解的多变量问题分组求解.每个机器人的路径视为子种群,子种群通过带精英策略的非支配排序遗传算法,进化并筛选出子种群的部分进入协同进化,每次迭代更新外部的精英解集,最终生成一组非支配路径解.仿真结果表明,在栅格地图环境下,本文算法可有效实现多移动机器人的多优化目标路径规划.